Bisimulation and action refinement

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model Refinement Using Bisimulation Quotients

The paper shows how to refine large-scale or even infinite transition systems so as to ensure certain desired properties. First, a given system is reduced into a smallish, finite bisimulation quotient. Second, the reduced system is refined in order to ensure a given property, using any known finite-state method. Third, the refined reduced system is expanded back into an adequate refinement of t...

متن کامل

XX Incremental Bisimulation Abstraction Refinement

ion refinement techniques in probabilistic model checking are prominent approaches to the verification of very large or infinite-state probabilistic concurrent systems. At the core of the refinement step lies the implicit or explicit analysis of a counterexample. This paper proposes an abstraction refinement approach for the probabilistic computation tree logic (PCTL), which is based on increme...

متن کامل

Approximate Bisimulation Equivalence and Variable Refinement

In this paper, we consider an operator for refinement of variables to be used in the design of hybrid system. Variables on a given level of abstraction are replaced by more complicated processes on a lower level just like the function are called in the program. Then we established the equivalence, bisimulation equivalence and approximate bisimulation equivalence which are by polynomial flow eve...

متن کامل

Deciding and Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement

We propose two techniques for expressing the ST semantics for terms of a process algebra. The first technique, which is more intuitive, is based on the idea of giving unique names to actions and allows to decide and axiomatize weak ST bisimulation for all processes that possess a finite state interleaving semantics. The second technique, which is based on pointers, allows to preserve the possib...

متن کامل

Action Refinement

This paper is a thourough survey on the state of the art of action refinement in process algebra, with a historical perspective. (To appear as Chapter XVI of the Handbook of Process Algebra, Elsevier Science, 1999.) 1. Università di Bologna, Dipartimento di Scienze dell’Informazione, Mura Anteo Zamboni 7, 40127 Bologna, Italy. E-mail: [email protected]. 2. University of Twente, Department of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1993

ISSN: 0304-3975

DOI: 10.1016/0304-3975(93)90157-o